On Point-Sets That Support Planar Graphs
نویسندگان
چکیده
Article history: Received 14 October 2011 Accepted 27 March 2012 Available online xxxx Communicated by D. Wagner
منابع مشابه
On Universal Point Sets for Planar Graphs
A set P of points in R is n-universal, if every planar graph on n vertices admits a plane straight-line embedding on P. Answering a question by Kobourov, we show that there is no n-universal point set of size n, for any n 15. Conversely, we use a computer program to show that there exist universal point sets for all n 10 and to enumerate all corresponding order types. Finally, we describe a col...
متن کاملSmall Point Sets for Simply-Nested Planar Graphs
A point set P ⊆ R is universal for a class G if every graph of G has a planar straight-line embedding into P . We prove that there exists a O(n( logn log log n )) size universal point set for the class of simply-nested n-vertex planar graphs. This is a step towards a full answer for the well-known open problem on the size of the smallest universal point sets for planar graphs [1,5,9].
متن کاملOn Graphs Supported by Line Sets
For a set S of n lines labeled from 1 to n, we say that S supports an n-vertex planar graph G if for every labeling from 1 to n of its vertices, G has a straight-line crossing-free drawing with each vertex drawn as a point on its associated line. It is known from previous work [4] that no set of n parallel lines supports all n-vertex planar graphs. We show that intersecting lines, even if they ...
متن کاملIncreasing-Chord Graphs On Point Sets
We tackle the problem of constructing increasing-chord graphs spanning point sets. We prove that, for every point set P with n points, there exists an increasing-chord planar graph with O(n) Steiner points spanning P . Further, we prove that, for every convex point set P with n points, there exists an increasingchord graph with O(n log n) edges (and with no Steiner points) spanning P .
متن کاملOn the M-polynomial of planar chemical graphs
Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011